Axiom systems of distributive lattice

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total graph of a $0$-distributive lattice

Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...

متن کامل

Distributive Lattice-Structured Ontologies

In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attribution operations that preserve ∨, ∧ and ⊥. The preservation of ∧ allows the attributes to model the natural join operation in databases. We start by introducing ontological frameworks and knowledge bases and define the notion ...

متن کامل

Coproducts of Distributive Lattice based Algebras

The analysis of coproducts in varieties of algebras has generally been variety-specific, relying on tools tailored to particular classes of algebras. A recurring theme, however, is the use of a categorical duality. Among the dualities and topological representations in the literature, natural dualities are particularly well behaved with respect to coproduct. Since (multisorted) natural dualitie...

متن کامل

Reimer's Inequality on a Finite Distributive Lattice

We generalize Reimer’s Inequality [6] (a.k.a the BKR Inequality or the van den Berg–Kesten Conjecture [1]) to the setting of finite distributive lattices. (MSC 60C05)

متن کامل

Relational Algebra as non-Distributive Lattice

We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 1970

ISSN: 0386-2194

DOI: 10.3792/pja/1195520302